n = [i for i in reversed(range(0, 100))]


def f(a: list, n: int, t: int) -> int:
    l, r = -1, n

    while l + 1 != r:
        mid = (l + r) // 2
        if a[mid] > t:
            l = mid
        else:
            r = mid
    return r


print(f(n, len(n), 4))
